Greetings
I am a postdoc at the Simons Institute for the Theory of Computing at UC Berkeley, where I work with Peter Bartlett and Jason D. Lee. In 2027, I will be joining the faculty in the School of Computer Science at the University of Sydney.
I completed my PhD at the University of Illinois, Urbana-Champaign, where I was advised by the eminent Nan Jiang. During my PhD, I’ve also been fortunate to work with magnificent researchers Dylan J. Foster and Akshay Krishnamurty (Microsoft Research), Dean P. Foster (Amazon Research), and Csaba Szepesvári (University of Alberta). Before that, in a distant land, I completed a MSc in Computer Science (advised by the formidable Prakash Panangaden and Marc G. Bellemare) and a BSc in Maths & Physics at McGill University.
Here are links to my Google Scholar and my perpetually outdated CV. I can be reached at p.amortila@berkeley.edu.
Education
2019 — 2025. PhD in Computer Science at University of Illinois, Urbana-Champaign.
Advised by Nan Jiang.
Thesis: Structure and Representation in Statistical Reinforcement Learning. [pdf]
Committee: Nan Jiang, Csaba Szepesvári, Maxim Raginsky, Arindam Banerjee.
2017 — 2019. MSc in Computer Science at McGill University.
Advised by Prakash Panangaden and Marc G. Bellemare.
Thesis: Couplings in Reinforcement Learning — Applications to State Abstraction and Algorithm Analysis. [pdf]
2013 — 2017. BSc in Honours Maths & Physics at McGill University.
Distinctions: First Class Honours, Principal’s Student-Athlete Honour Roll.
Positions
2025 — 2027. Postdoctoral Fellow at Simons Institute for the Theory of Computing, UC Berkeley.
Advised by Peter Bartlett and Jason D. Lee.
2023. Research Intern at Microsoft Research, New England.
Advised by Dylan Foster and Akshay Krishnamurthy.
2021 & 2022. Research Intern at Amazon Research, New York.
Advised by Dean P. Foster.
2020 & 2021. Visiting Researcher at University of Alberta.
Advised by Csaba Szepesvári.
Publications
Preprints
Model Selection for Off-Policy Evaluation: New Algorithms and Experimental Protocol
Pai Liu, Lingfeng Zhao, Shivangi Agarwal, Jinghan Liu, Audrey Huang, Philip Amortila, Nan Jiang [arXiv]
Conference Papers
Reinforcement Learning under Latent Dynamics: Toward Statistical and Algorithmic Modularity
Philip Amortila, Dylan J. Foster, Nan Jiang, Akshay Krishnamurthy, Zakaria Mhammedi
Mitigating Covariate Shift in Misspecified Regression with Applications to Reinforcement Learning
Philip Amortila, Tongyi Cao, Akshay Krishnamurthy
COLT 2024 [arXiv]
Scalable Online Exploration via Coverability
Philip Amortila, Dylan J. Foster, Akshay Krishnamurthy
Harnessing Density Ratios for Online Reinforcement Learning
Philip Amortila, Dylan J. Foster, Nan Jiang, Ayush Sekhari, Tengyang Xie
ICLR 2024 Spotlight Presentation [arXiv]
The Optimal Approximation Factors in Misspecified Off-Policy Value Function Estimation
Philip Amortila, Nan Jiang, Csaba Szepesvari
ICML 2023 [arXiv]
A Few Expert Queries Suffices for Sample-Efficient RL with Resets and Linear Value Approximation
Philip Amortila, Nan Jiang, Dhruv Madeka, Dean P. Foster
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function
Gellert Weisz, Philip Amortila, Barnabàs Janzer, Yasin Abbasi-Yadkori, Nan Jiang, Csaba Szepesvári
Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions
Gellert Weisz, Philip Amortila, Csaba Szepesvári
Solving Constrained Markov Decision Processes via Backward Value Functions
Harsh Satija, Philip Amortila, Joelle Pineau
A Distributional Analysis of Sampling-Based Reinforcement Learning Algorithms
Philip Amortila, Doina Precup, Prakash Panangaden, Marc G. Bellemare
AISTATS 2020 [arXiv, talk] & NeurIPS 2019 Optimization in RL Workshop Spotlight [talk]
Learning Graph Weighted Models on Pictures
Philip Amortila, Guillaume Rabusseau
ICGI 2018 [arXiv]
Workshop Papers
Temporally Extended Metrics for Markov Decision Processes
Philip Amortila, Marc G. Bellemare, Prakash Panangaden, Doina Precup
AAAI 2019 Safety in AI Workshop Spotlight [pdf]
Technical Notes
A Variant of the Wang-Foster-Kakade Lower Bound for the Discounted Setting
Philip Amortila, Nan Jiang, Tengyang Xie [arXiv]
2023. Finalist for Google PhD Fellowship (2023).
Nominated by UIUC for national competition (3 selected among all UIUC students).
2022. Finalist for Apple PhD Fellowship (2022)
Nominated by UIUC for national competition (3 selected among all UIUC students).
2021. Best Student Paper Award at ALT 2021.
2019. NSERC Postgraduate Doctoral Fellowship (PGS-D).